Conditional Superagonist CTL Ligands for the Promotion of Tumor-Specific CTL Responses

Conditional superagonist CTL ligands for the promotion of tumor-specific CTL responses.

Although it has been demonstrated that CTLs can be raised against tumor-associated self-antigens, achieving consistent and effective clinical responses has proven challenging. Superagonist altered peptide ligands (APLs) can often elicit potent antitumor CTL responses where the native tumor-associated epitope fails. Current methods have identified a limited number of superagonist APLs, including...

Identification of a Novel Tumor-Specific CTL

The Complexity of Satisfiability for Fragments of CTL and CTL

The satisfiability problems for CTL and CTL? are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that use less temporal or propositional operators, the complexity may decrease. This paper undertakes a systematic study of satisfiability for CTLand CTL?-formulae over restricted sets of propositional and temporal operator...

CTL and Equivalent Sublanguages of CTL

Specifications of finite state algorithms with a complex temporal behavior such as protocols or hardware systems are often given in temporal logics as e.g. CTL or CTL . On the one hand, CTL offers in comparison to CTL efficient model checking algorithms, but on the other hand, CTL seems to suffer from a limited expressiveness. In this paper, it is shown that the limitations one feels when using...

On the Hybrid Extension of CTL and CTL+

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that HCTL and HCTL, the hybrid extensions with one variable of CTL and CTL, respectively, are expressively equivale...